The Good lower bound of Second-order nonlinearity of a class of Boolean function
نویسندگان
چکیده
In this paper we find the lower bound of second-order nonlinearity of Boolean function fλ(x) = Trn 1 (λx p) with p = 22r + 2r + 1, λ ∈ F2r and n = 5r. It is also demonstrated that the lower bound obtained in this paper is much better than the lower bound obtained by Iwata-Kurosawa [14], and Gangopadhyay et al. (Theorem 1, [12]).
منابع مشابه
The Lower Bounds on the Second Order Nonlinearity of Cubic Boolean Functions
It is a difficult task to compute the r-th order nonlinearity of a given function with algebraic degree strictly greater than r > 1. Even the lower bounds on the second order nonlinearity is known only for a few particular functions. We investigate the lower bounds on the second order nonlinearity of cubic Boolean functions Fu(x) = Tr( Pm l=1 μlx l), where ul ∈ F ∗ 2n , dl = 2l + 2l + 1, il and...
متن کاملMaiorana-McFarland Functions with High Second-Order Nonlinearity
The second–order nonlinearity, and the best quadratic approximations, of Boolean functions are studied in this paper. We prove that cubic functions within the Maiorana–McFarland class achieve very high second order nonlinearity, which is close to an upper bound that was recently proved by Carlet et al., and much higher than the second order nonlinearity obtained by other known constructions. Th...
متن کاملA method for obtaining lower bounds on the higher order nonlinearity of Boolean function
Obtainment of exact value or high lower bound on the r-th order nonlinearity of Boolean function is a very complicated problem (especial if r > 1). In a number of papers lower bounds on the r-th order nonlinearity of Boolean function via its algebraic immunity were obtain for different r. This bounds is rather high for function with maximum near maximum possible algebraic immunity. In this pape...
متن کاملImproving the lower bound on the maximum nonlinearity of 1-resilient Boolean functions and designing functions satisfying all cryptographic criteria
In this paper, we improve the lower bound on the maximum nonlinearity of 1resilient Boolean functions, for n even, by proposing a method of constructing this class of functions attaining the best nonlinearity currently known. Thus for the first time, at least for small values of n, the upper bound on nonlinearity can be reached in a deterministic manner in difference to some heuristic search me...
متن کاملSecond Order Nonlinearities of Some Classes of Cubic Boolean Functions Based on Secondary Constructions
The higher order nonlinearity of a Boolean function is a cryptographic criterion, which play a role against attacks on stream and block ciphers. Also it play a role in coding theory, since it is related to the covering radii of Reed-Muller codes. In this paper, we study the lower bounds of second-order nonlinearities of a class of cubic Boolean functions of the form with and ∈ ′ and some classe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IACR Cryptology ePrint Archive
دوره 2011 شماره
صفحات -
تاریخ انتشار 2011